Kreiger Graphs and Fischer Covers vs Dynamical Properties
نویسندگان
چکیده
منابع مشابه
Planar Graphs and Covers
Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is wellknown. A general result is obtained for such graphs where no restriction is put on the number of ends. It is shown that such a graph can be built up from one-ended or finite pla...
متن کاملPartial covers of graphs
Given graphs G and H, a mapping f : V (G) → V (H) is a homomorphism if (f(u), f(v)) is an edge of H for every edge (u, v) of G. In this paper, we initiate the study of computational complexity of locally injective homomorphisms called partial covers of graphs. We motivate the study of partial covers by showing a correspondence to generalized (2,1)-colorings of graphs, the notion stemming from a...
متن کاملVertex Covers and Connected Vertex Covers in 3-connected Graphs
A vertex cover of a graph G=(V,E) is a subset N of V such that each element of E is incident upon some element of N, where V and E are the sets of vertices and of edges of G, respectively. A connected vertex cover of a graph G is a vertex cover of G such that the subgraph G[N] induced by N of G is connected. The minimum vertex cover problem (VCP) is the problem of finding a vertex cover of mini...
متن کاملOn covers of graphs by Cayley graphs
We prove that every vertex transitive, planar, 1-ended, graph covers every graph whose balls of radius r are isomorphic to the ball of radius r in G for a sufficiently large r. We ask whether this is a general property of finitely presented Cayley graphs, as well as further related questions.
متن کاملIdentifying Vertex Covers in Graphs
An identifying vertex cover in a graph G is a subset T of vertices in G that has a nonempty intersection with every edge of G such that T distinguishes the edges, that is, e∩T 6= ∅ for every edge e in G and e∩T 6= f ∩T for every two distinct edges e and f in G. The identifying vertex cover number τD(G) of G is the minimum size of an identifying vertex cover in G. We observe that τD(G) + ρ(G) = ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Advances in Mathematics and Computer Science
سال: 2019
ISSN: 2456-9968
DOI: 10.9734/jamcs/2019/v32i130136